By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 22, Issue 1, pp. 1-423

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms

Tomás Feder, Pavol Hell, and Jing Huang

pp. 1-14

BibTeX  Abstract Full Text:  PDF

Faces of Generalized Cluster Complexes and Noncrossing Partitions

Eleni Tzanaki

pp. 15-30

BibTeX  Abstract Full Text:  PDF

Switching Operations for Hadamard Matrices

William P. Orrick

pp. 31-50

BibTeX  Abstract Full Text:  PDF

Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs

Frédéric Maffray, Nicolas Trotignon, and Kristina Vušković

pp. 51-71

BibTeX  Abstract Full Text:  PDF

A New Algorithm for On-line Coloring Bipartite Graphs

Hajo J. Broersma, Agostino Capponi, and Daniël Paulusma

pp. 72-91

BibTeX  Abstract Full Text:  PDF

Average Distance and Edge-Connectivity I

Peter Dankelmann, Simon Mukwembi, and Henda C. Swart

pp. 92-101

BibTeX  Abstract Full Text:  PDF

Tree-Related Widths of Graphs and Hypergraphs

Isolde Adler

pp. 102-123

BibTeX  Abstract Full Text:  PDF

Reconfigurations in Graphs and Grids

Gruia Călinescu, Adrian Dumitrescu, and János Pach

pp. 124-138

BibTeX  Abstract Full Text:  PDF

List-Coloring Squares of Sparse Subcubic Graphs

Zdeněk Dvořák, Riste Škrekovski, and Martin Tancer

pp. 139-159

BibTeX  Abstract Full Text:  PDF

Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees

Qunqiang Feng, Hosam M. Mahmoud, and Alois Panholzer

pp. 160-184

BibTeX  Abstract Full Text:  PDF

$l$-Chain Profile Vectors

Dániel Gerbner and Balázs Patkós

pp. 185-193

BibTeX  Abstract Full Text:  PDF

Planarity, Colorability, and Minor Games

Dan Hefetz, Michael Krivelevich, Miloš Stojaković, and Tibor Szabó

pp. 194-212

BibTeX  Abstract Full Text:  PDF

$L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3

Jeong-Hyun Kang

pp. 213-230

BibTeX  Abstract Full Text:  PDF

3-Facial Coloring of Plane Graphs

Frédéric Havet, Jean-Sébastien Sereni, and Riste Škrekovski

pp. 231-247

BibTeX  Abstract Full Text:  PDF

Normalized Matching Property of Restricted Subspace Lattices

Jun Wang and Huajun Zhang

pp. 248-255

BibTeX  Abstract Full Text:  PDF

Matroid Pathwidth and Code Trellis Complexity

Navin Kashyap

pp. 256-272

BibTeX  Abstract Full Text:  PDF

On the Duals of Binary Hyper-Kloosterman Codes

Marko Moisio

pp. 273-287

BibTeX  Abstract Full Text:  PDF

Ore Condition and Nowhere-Zero 3-Flows

Genghua Fan and Chuixiang Zhou

pp. 288-294

BibTeX  Abstract Full Text:  PDF

Large Monochromatic Components in Two-Colored Grids

JiřÍ Matoušek and Aleš PřÍvětivý

pp. 295-311

BibTeX  Abstract Full Text:  PDF

Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction

Andrei Krokhin and Benoit Larose

pp. 312-328

BibTeX  Abstract Full Text:  PDF

On Planar Quasi-Parity Graphs

Cláudia Linhares Sales, Frédéric Maffray, and Bruce Reed

pp. 329-347

BibTeX  Abstract Full Text:  PDF

An Explicit Bound On Double Exponential Sums Related to Diffie–Hellman Distributions

Mei-Chu Chang and Chui Zhi Yao

pp. 348-359

BibTeX  Abstract Full Text:  PDF

Characterizing Ideal Weighted Threshold Secret Sharing

Amos Beimel, Tamir Tassa, and Enav Weinreb

pp. 360-397

BibTeX  Abstract Full Text:  PDF

Adapted List Coloring of Graphs and Hypergraphs

A. V. Kostochka and Xuding Zhu

pp. 398-408

BibTeX  Abstract Full Text:  PDF

Unit Circular-Arc Graph Representations and Feasible Circulations

Min Chih Lin and Jayme L. Szwarcfiter

pp. 409-423

BibTeX  Abstract Full Text:  PDF